Bisimulation and Coverings for Graphs and Hypergraphs
نویسنده
چکیده
We survey notions of bisimulation and of bisimilar coverings both in the world of graph-like structures (Kripke structures, transition systems) and in the world of hypergraph-like general relational structures. The provision of finite analogues for full infinite tree-like unfoldings, in particular, raises interesting combinatorial challenges and is the key to a number of interesting model-theoretic applications.
منابع مشابه
CATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS
In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملPartitions of Graphs into Coverings and Hypergraphs into Transversals
A covering of a multigraph G is a subset of edges which meet ail vertices of G. Partitions of the edges of G into coverings Ci, C2,..., Ck are considered. In particular we examine how close the cardinalities of thèse coverings may be. A resuit concerning matchings is extended to the décomposition into coverings. Finally thèse considérations are generalized to the décompositions of the vertices ...
متن کاملDISCRETE MATHEMATICS Line hypergraphs
In this paper, we introduce a new multivalued function ~ called the line hypergraph. The function ~ generalizes two classical concepts at once, namely, of the line graph and the dual hypergraph. In terms of this function, proofs of some known theorems on line graphs can be unified and their more general versions can be obtained. Three such theorems are considered here, namely, the Berge theorem...
متن کاملRecognizing large-degree Intersection Graphs of Linear 3-Uniform Hypergraphs
The intersection graph or the line graph Ω(H) of a hypergraph H is defined as follows: 1) the vertices of Ω(H) are in a bijective correspondence with the edges of H, 2) two vertices are adjacent in Ω(H) if and only if the corresponding edges intersect. Characterizing and recognizing intersection graphs of hypergraphs with some additional property P is one of the central problems in intersection...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013